package com.back_end.Array.Pascal;

import java.util.Scanner;

public class pascal_triangle {
    //杨辉三角：

/*
 请输入多少行杨辉三角：
10
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
1 6 15 20 15 6 1
1 7 21 35 35 21 7 1
1 8 28 56 70 56 28 8 1
1 9 36 84 126 126 84 36 9 1
*/


    public static void main(String[] args) {
        int[][] arr;
        System.out.println("请输入多少行杨辉三角：");
        Scanner sacnner = new Scanner(System.in);
        int n = sacnner.nextInt();
        arr = new int[n][n];

        int i;
        int j;
        for(i=0;i<arr.length;i++){
            for (j=0;j<=i;j++){
                if(j==0||j==i){
                   arr[i][j] = 1;
                }else{
                    arr[i][j] =arr[i-1][j-1]+arr[i-1][j];
                }
            }
        }

        for (int x=0;x<arr.length;x++){
            for(int y=0;y<=x;y++){
                System.out.print(arr[x][y] + " ");
            }
            System.out.println();
        }
    }
}
